On k-Term DNF with the Largest Number of Prime Implicants
نویسندگان
چکیده
It is known that a k-term DNF can have at most 2k − 1 prime implicants and that this bound is sharp. We determine all k-term DNF having the maximal number of prime implicants. It is shown that a DNF is maximal if and only if it corresponds to a non-repeating decision tree with literals assigned to the leaves in a certain way. We also mention some related results and open problems.
منابع مشابه
Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case strongly differs from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but checking p...
متن کاملAn improvement on the complexity of factoring read-once Boolean functions
Read-once functions have gained recent, renewed interest in thefields of theory and algorithmsofBoolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A.Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. M...
متن کاملBoolean functions with long prime implicants
In this short note we introduce a class of Boolean functions defined by a minimum length of its prime implicants. We show that given a DNF one can test in polynomial time whether it represents a function from this class. Moreover, in case that the answer is affirmative we present a polynomial time algorithm which outputs a shortest DNF representation of the given function. Therefore the defined...
متن کاملPrime Implicants and Belief Update
Adaptation is one of the most important capabilities that an intelligent agent should present. In order to provide this capability to logical-based agents, the Belief Change area proposes methods to incorporate new information in a belief set. Properties like consistency and minimal change guide the change process. The notion of minimal change is usually associated with a closeness criterion ba...
متن کاملComplexity of DNF minimization and isomorphism testing for monotone formulas
We investigate the complexity of finding prime implicants and minimum equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case differs strongly from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but the equiva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 21 شماره
صفحات -
تاریخ انتشار 2008